R-Simp: Model Simplification In Reverse, A Vector Quantization Approach

نویسنده

  • Dmitry D. Brodsky
چکیده

Just as colour image quantization can be viewed as simplification of a three dimensional colour in a two dimensional image, model simplification can be viewed as quantization of three dimensional normal vectors on a two dimensional surface. Thus many of the approaches used in quantization can be applied to the problem of model simplification. We present a model simplification algorithm that is based on the splitting algorithm from quantization literature. The algorithm works in reverse by expanding from a coarse to a fine model. It employs large scale curvature measures to determine which portion of the model to partition next, and how to partition it. The algorithm can accept non-manifold input models, and is capable of simplifying topology. It produces good quality simplifications, and is faster than most other simplification algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R-Simp: Model Simplification In Reverse

Our algorithm simplifies vertex connectivity using the clustering techniques described in [3]. Unlike [3], it does not evenly voxelize the model; instead simplification varies with curvature. The algorithm begins with the entire model contained within a single cell. This cell is subdivided based on the curvature within the cell. From the cells that result, the cell with the most curvature is se...

متن کامل

Model Simplification for Interactive Applications

As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. We present a simplification algorithm suitable for interactive applications. The algorithm is fast and can guarantee displayable results within a given time limit. Results also have good quality. Inspired by splitting algorithms from vector quantization literature...

متن کامل

Model Simplification Through Refinement

As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplification algorithms are not well suited for this task because they are either too slow (requiring the simplified model to be pre-computed) or produce models that are too poor in quality. These shortcomings become particula...

متن کامل

Parallel Model Simplification of Very Large Polygonal Meshes

Working with polygonal models that contain tens of millions of polygons or more is difficult because such models tend not to fit into the core memory of a typical workstation. Even models of only a few million polygons are too large. A typical workstation has a gigabyte of memory, but these large models require an order of magnitude more. Rendering and other manipulations of polygonal models of...

متن کامل

A Case Study of Improving Memory Locality in Polygonal Model Simplification: Metrics and Performance

Trade-offs between quality and performance are important issues in real-time computer graphics and visualization. Polygonal model simplification algorithms take a full-sized polygonal model as input and output a less-detailed version of the model with fewer polygons. For real-time display, fewer polygons result in faster rendering. For other applications, the speed of rendering may be traded-of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999